TSTP Solution File: SET580^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET580^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:19:02 EDT 2024
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 3 unt; 4 typ; 0 def)
% Number of atoms : 75 ( 0 equ; 0 cnn)
% Maximal formula atoms : 48 ( 5 avg)
% Number of connectives : 203 ( 44 ~; 54 |; 15 &; 86 @)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 4 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 6 ( 0 ^ 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
a: $tType ).
thf(decl_22,type,
esk1_0: a ).
thf(decl_23,type,
epred1_0: a > $o ).
thf(decl_24,type,
epred2_0: a > $o ).
thf(cBOOL_PROP_23_pme,conjecture,
! [X1: a,X2: a > $o,X3: a > $o] :
( ( ( ( ( X2 @ X1 )
& ~ ( X3 @ X1 ) )
| ( ( X3 @ X1 )
& ~ ( X2 @ X1 ) ) )
<=> ( X2 @ X1 ) )
<=> ~ ( X3 @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.AEpVbPqEEp/E---3.1_31320.p',cBOOL_PROP_23_pme) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: a,X2: a > $o,X3: a > $o] :
( ( ( ( ( X2 @ X1 )
& ~ ( X3 @ X1 ) )
| ( ( X3 @ X1 )
& ~ ( X2 @ X1 ) ) )
<=> ( X2 @ X1 ) )
<=> ~ ( X3 @ X1 ) ),
inference(assume_negation,[status(cth)],[cBOOL_PROP_23_pme]) ).
thf(c_0_2,negated_conjecture,
( ( ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) )
& ( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
thf(c_0_3,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_6,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_3]) ).
thf(c_0_7,negated_conjecture,
( ( epred1_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_9,negated_conjecture,
( ~ ( epred1_0 @ esk1_0 )
| ~ ( epred2_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_5]) ).
thf(c_0_10,negated_conjecture,
epred1_0 @ esk1_0,
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( epred2_0 @ esk1_0 )
| ~ ( epred1_0 @ esk1_0 ) ),
inference(cn,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
~ ( epred2_0 @ esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SET580^5 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n009.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Fri May 3 10:15:25 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running higher-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.AEpVbPqEEp/E---3.1_31320.p
% 0.16/0.43 # Version: 3.1.0-ho
% 0.16/0.43 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.43 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_9 with 300s (1) cores
% 0.16/0.43 # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.43 # Starting post_as_ho4 with 300s (1) cores
% 0.16/0.43 # Starting post_as_ho2 with 300s (1) cores
% 0.16/0.43 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.16/0.43 # Starting full_lambda_10 with 300s (1) cores
% 0.16/0.43 # Starting new_ho_8 with 300s (1) cores
% 0.16/0.43 # post_as_ho12 with pid 31399 completed with status 0
% 0.16/0.43 # Result found by post_as_ho12
% 0.16/0.43 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.43 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.43 # No SInE strategy applied
% 0.16/0.43 # Search class: HGHNF-FFSF00-SSSFFFNN
% 0.16/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting sh3 with 163s (1) cores
% 0.16/0.43 # sh3 with pid 31408 completed with status 0
% 0.16/0.43 # Result found by sh3
% 0.16/0.43 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.43 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.43 # No SInE strategy applied
% 0.16/0.43 # Search class: HGHNF-FFSF00-SSSFFFNN
% 0.16/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting sh3 with 163s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Theorem
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 2
% 0.16/0.43 # Removed by relevancy pruning/SinE : 0
% 0.16/0.43 # Initial clauses : 13
% 0.16/0.43 # Removed in clause preprocessing : 9
% 0.16/0.43 # Initial clauses in saturation : 4
% 0.16/0.43 # Processed clauses : 5
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 0
% 0.16/0.43 # ...remaining for further processing : 4
% 0.16/0.43 # Other redundant clauses eliminated : 0
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 0
% 0.16/0.43 # Backward-rewritten : 2
% 0.16/0.43 # Generated clauses : 0
% 0.16/0.43 # ...of the previous two non-redundant : 1
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 1
% 0.16/0.43 # Paramodulations : 0
% 0.16/0.43 # Factorizations : 0
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 0
% 0.16/0.43 # Disequality decompositions : 0
% 0.16/0.43 # Total rewrite steps : 3
% 0.16/0.43 # ...of those cached : 2
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 2
% 0.16/0.43 # Positive orientable unit clauses : 1
% 0.16/0.43 # Positive unorientable unit clauses: 0
% 0.16/0.43 # Negative unit clauses : 1
% 0.16/0.43 # Non-unit-clauses : 0
% 0.16/0.43 # Current number of unprocessed clauses: 0
% 0.16/0.43 # ...number of literals in the above : 0
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 2
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 1
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 1
% 0.16/0.43 # Non-unit clause-clause subsumptions : 1
% 0.16/0.43 # Unit Clause-clause subsumption calls : 0
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 1
% 0.16/0.43 # BW rewrite match successes : 1
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 947
% 0.16/0.43 # Search garbage collected termcells : 207
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.003 s
% 0.16/0.43 # System time : 0.000 s
% 0.16/0.43 # Total time : 0.003 s
% 0.16/0.43 # Maximum resident set size: 1752 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.004 s
% 0.16/0.43 # System time : 0.002 s
% 0.16/0.43 # Total time : 0.006 s
% 0.16/0.43 # Maximum resident set size: 1712 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E exiting
%------------------------------------------------------------------------------